Tangled Thrackles
نویسندگان
چکیده
A tangle is a graph drawn in the plane so that any pair of edges have precisely one point in common, and this point is either an endpoint or a point of tangency. If we allow a third option: the common point may be a proper crossing between the two edges, then the graph is called a tangled thrackle. We establish the following analogues of Conway’s thrackle conjecture: The number of edges of a tangle cannot exceed its number of vertices, n. We also prove that the number of edges of an x-monotone tangled thrackle with n vertices is at most n+1. Both results are tight for n > 3. For not necessarily x-monotone tangled thrackles, we have a somewhat weaker, but nearly linear, upper bound.
منابع مشابه
Bounds for Generalized Thrackles
A thrackle (resp. generalized thrackle) is a drawing of a graph in which each pair of edges meets precisely once (resp. an odd number of times). For a graph with n vertices and m edges, we show that, for drawings in the plane, m ≤ 32 (n− 1) for thrackles, while m ≤ 2n − 2 for generalized thrackles. This improves theorems of Lovász, Pach, and Szegedy. The paper also examines thrackles in the mor...
متن کاملTowards generalizing thrackles to arbitrary graphs
In the 1950s, John Conway came up with the notion of thrackles, graphs with embeddings in which no edge crosses itself, but every pair of distinct edges intersects each other exactly once. He conjectured that |E(G)| ≤ |V (G)| for any thrackle G, a question unsolved to this day. In this paper, we discuss some of the known properties of thrackles and contribute a few new ones. Only a few sparse g...
متن کاملA Reduction of Conway’s Thrackle Conjecture
A thrackle is a drawing of a simple graph on the plane, where each edge is drawn as a smooth arc with distinct end-points, and every two arcs have exactly one common point, at which they have distinct tangents. Conway, who coined the term thrackle, conjectured that there is no thrackle with more edges than vertices – a question which is still unsolved. A full thrackle is one with n vertices and...
متن کاملConway's Conjecture for Monotone Thrackles
A drawing of a graph in the plane is called a thrackle if every pair of edges meet precisely once, either at a common vertex or at a proper crossing. According to Conway’s conjecture, every thrackle has at most as many edges as vertices. We prove this conjecture for x-monotone thrackles, that is, in the case when every edge meets every vertical line in at most one point.
متن کاملA Study of Conway's Thrackle Conjecture
A thrackle is a drawing of a simple graph on the plane, where each edge is drawn as a smooth arc with distinct end-points, and every two arcs have exactly one common point, at which they have distinct tangents. Conway, who coined the term thrackle, conjectured that there is no thrackle with more edges than vertices – a question which is still unsolved. A full thrackle is one with n vertices and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011